Reinforced Island Model Genetic Algorithm to Solve University Course Timetabling
نویسندگان
چکیده
منابع مشابه
Application of the Grouping Genetic Algorithm to University Course Timetabling
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constraints and, as much as possible, some soft constraints. Here we work with a well-known version of the problem where there seems a strong case for considering these two goals as separate sub-problems. In particular we no...
متن کاملSOLVING UNIVERSITY COURSE TIMETABLING PROBLEM USING GENETIC ALGORITHM Master Thesis
This is to certify that we have read this thesis and that we find it fully adequate in scope, quality and content, as a thesis for the degree of Master of Science. continously asking me " how is the thesis going? " , because she encouraged me to persevere without knowing it. Also I would like to thank to my best friend, my colleague, my dear husband Tarkan Aydın for his understanding, patience,...
متن کاملKnowledge-based genetic algorithm for university course timetabling problems
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimization techniques. Our solution methodology is based on a genetic algorithm which uses an installed knowledge base and an infection operation. The knowledge base here is a set of candidate partial solutions of the final...
متن کاملUsing improved Memetic Algorithm and local search to solve University Course Timetabling Problem (UCTP)
Course Timetabling is a complex problem, happening at the beginning of every semester at universities. In this problem, one of the most important issues is variety of constraints, which results in different ways of timetabling in different universities. Comparing to exact methods which take lots of time to solve UCTP, metaheuristic methods produce a feasible solution within reasonable computati...
متن کاملA memetic algorithm for University Course Timetabling
We present here a metaheuristic approach to the university course timetabling problem using a memetic algorithm with a very effective local search. The algorithm was tested on the International Timetabling Competition benchmark instances. Results are encouraging and show that evolutionary computation with the help of local search can compete with succesful algorithms on the problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TELKOMNIKA (Telecommunication Computing Electronics and Control)
سال: 2018
ISSN: 2302-9293,1693-6930
DOI: 10.12928/telkomnika.v16i6.9691